A proof of Parisi?s conjecture on the random assignment problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A proof of Parisi’s conjecture on the random assignment problem

An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random assignment problem if the matrix entries are random variables. We give a formula for the expected value of the optimal k-assignment in a matrix where some of the...

متن کامل

A Proof of a Conjecture of Buck, Chan and Robbins on the Random Assignment Problem

We prove the main conjecture of the paper “On the expected value of the minimum assignment” by Marshall W. Buck, Clara S. Chan, and David P. Robbins (Random Structures & Algorithms 21 (2002), no. 1, 33–58). This is a vast generalization of a formula conjectured by Giorgio Parisi for the n by n random assignment problem. 1. The Parisi formula This work is motivated by a conjecture made in 1998 b...

متن کامل

Proof of a conjecture on the slit plane problem

Let ai,j(n) denote the number of walks in n steps from (0, 0) to (i, j), with steps (±1, 0) and (0,±1), never touching a point (−k, 0) with k ≥ 0 after the starting point. Bousquet-Mélou and Schaeffer conjectured a closed form for the number a −i,i(2n) when i ≥ 1. In this paper, we prove their conjecture, and give a formula for a −i,i(2n) for i ≤ −1.

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

the problem of divine hiddenness

این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2004

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-003-0308-9